全文获取类型
收费全文 | 24480篇 |
免费 | 4907篇 |
国内免费 | 4213篇 |
专业分类
电工技术 | 1345篇 |
技术理论 | 2篇 |
综合类 | 2635篇 |
化学工业 | 835篇 |
金属工艺 | 319篇 |
机械仪表 | 831篇 |
建筑科学 | 563篇 |
矿业工程 | 135篇 |
能源动力 | 304篇 |
轻工业 | 319篇 |
水利工程 | 123篇 |
石油天然气 | 159篇 |
武器工业 | 87篇 |
无线电 | 2543篇 |
一般工业技术 | 1549篇 |
冶金工业 | 1939篇 |
原子能技术 | 30篇 |
自动化技术 | 19882篇 |
出版年
2024年 | 363篇 |
2023年 | 2001篇 |
2022年 | 3081篇 |
2021年 | 3055篇 |
2020年 | 2496篇 |
2019年 | 1673篇 |
2018年 | 1185篇 |
2017年 | 1030篇 |
2016年 | 1068篇 |
2015年 | 1036篇 |
2014年 | 1428篇 |
2013年 | 1235篇 |
2012年 | 1245篇 |
2011年 | 1497篇 |
2010年 | 1230篇 |
2009年 | 1225篇 |
2008年 | 1233篇 |
2007年 | 1121篇 |
2006年 | 957篇 |
2005年 | 884篇 |
2004年 | 688篇 |
2003年 | 584篇 |
2002年 | 535篇 |
2001年 | 403篇 |
2000年 | 345篇 |
1999年 | 286篇 |
1998年 | 270篇 |
1997年 | 221篇 |
1996年 | 182篇 |
1995年 | 149篇 |
1994年 | 116篇 |
1993年 | 112篇 |
1992年 | 93篇 |
1991年 | 45篇 |
1990年 | 47篇 |
1989年 | 45篇 |
1988年 | 29篇 |
1987年 | 27篇 |
1986年 | 41篇 |
1966年 | 14篇 |
1965年 | 24篇 |
1964年 | 25篇 |
1963年 | 23篇 |
1962年 | 12篇 |
1961年 | 17篇 |
1959年 | 15篇 |
1958年 | 16篇 |
1957年 | 22篇 |
1956年 | 13篇 |
1955年 | 23篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
31.
A conceptualization of intended learning outcomes supporting self‐regulated learners in indicating learning paths 下载免费PDF全文
P. Tangworakitthaworn L. Gilbert G.B. Wills 《Journal of Computer Assisted Learning》2015,31(5):393-404
Intended learning outcomes (ILOs) indicate what learners will be able to achieve after they are taught. Traditionally, ILOs are expressed as plain text or unstructured documents. What if all ILOs of a specific course of study can be conceptualized through a structured diagrammatic technique? It was hypothesized that learners can benefit from this conceptualization in learning, especially in self‐regulated learning. The aim of this study was to investigate whether the ILOs represented in unstructured or structured formats can facilitate learners to identify learning paths. The results revealed that the mean ratings of all learning paths were statistically significantly higher with structured ILOs. 相似文献
32.
目前网络上的服装图像数量增长迅猛,对于大量服装图像实现智能分类的需求日益增加。将基于区域的全卷积网络(Region-Based Fully Convolutional Networks,R-FCN)引入到服装图像识别中,针对服装图像分类中网络训练时间长、形变服装图像识别率低的问题,提出一种新颖的改进框架HSR-FCN。新框架将R-FCN中的区域建议网络和HyperNet网络相融合,改变图片特征学习方式,使得HSR-FCN可以在更短的训练时间内达到更高的准确率。在模型中引入了空间转换网络,对输入服装图像和特征图进行了空间变换及对齐,加强了对多角度服装和形变服装的特征学习。实验结果表明,改进后的HSR-FCN模型有效地加强了对形变服装图像的学习,且在训练时间更短的情况下,比原来的网络模型R-FCN平均准确率提高了大约3个百分点,达到96.69%。 相似文献
33.
34.
Yaw control systems orientate the rotor of a wind turbine into the wind direction, optimize the wind power generated by wind turbines and alleviate the mechanical stresses on a wind turbine. Regarding the advantages of yaw control systems, a k-nearest neighbor classifier (k-NN) has been developed in order to forecast the yaw position parameter at 10-min intervals in this study. Air temperature, atmosphere pressure, wind direction, wind speed, rotor speed and wind power parameters are used in 2, 3, 4, 5 and 6-dimensional input spaces. The forecasting model using Manhattan distance metric for k = 3 uncovered the most accurate performance for atmosphere pressure, wind direction, wind speed and rotor speed inputs. However, the forecasting model using Euclidean distance metric for k = 1 brought out the most inconsistent results for atmosphere pressure and wind speed inputs. As a result of multi-tupled analyses, many feasible inferences were achieved for yaw position control systems. In addition, the yaw position forecasting model developed was compared with the persistence model and it surpassed the persistence model significantly in terms of the improvement percent. 相似文献
35.
36.
现阶段的语义解析方法大部分都基于组合语义,这类方法的核心就是词典。词典是词汇的集合,词汇定义了自然语言句子中词语到知识库本体中谓词的映射。语义解析一直面临着词典中词汇覆盖度不够的问题。针对此问题,该文在现有工作的基础上,提出了基于桥连接的词典学习方法,该方法能够在训练中自动引入新的词汇并加以学习,为了进一步提高新学习到的词汇的准确度,该文设计了新的词语—二元谓词的特征模板,并使用基于投票机制的核心词典获取方法。该文在两个公开数据集(WebQuestions和Free917)上进行了对比实验,实验结果表明,该文方法能够学习到新的词汇,提高词汇的覆盖度,进而提升语义解析系统的性能,特别是召回率。 相似文献
37.
In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources. 相似文献
39.
Traditional Multiple Empirical Kernel Learning (MEKL) expands the expressions of the sample and brings better classification ability by using different empirical kernels to map the original data space into multiple kernel spaces. To make MEKL suit for the imbalanced problems, this paper introduces a weight matrix and a regularization term into MEKL. The weight matrix assigns high misclassification cost to the minority samples to balanced misclassification cost between minority and majority class. The regularization term named Majority Projection (MP) is used to make the classification hyperplane fit the distribution shape of majority samples and enlarge the between-class distance of minority and majority class. The contributions of this work are: (i) assigning high cost to minority samples to deal with imbalanced problems, (ii) introducing a new regularization term to concern the property of data distribution, (iii) and modifying the original PAC-Bayes bound to test the error upper bound of MEKL-MP. Through analyzing the experimental results, the proposed MEKL-MP is well suited to the imbalanced problems and has lower generalization risk in accordance with the value of PAC-Bayes bound. 相似文献
40.
AbstractMulti-agent systems need to communicate to coordinate a shared task. We show that a recurrent neural network (RNN) can learn a communication protocol for coordination, even if the actions to coordinate are performed steps after the communication phase. We show that a separation of tasks with different temporal scale is necessary for successful learning. We contribute a hierarchical deep reinforcement learning model for multi-agent systems that separates the communication and coordination task from the action picking through a hierarchical policy. We further on show, that a separation of concerns in communication is beneficial but not necessary. As a testbed, we propose the Dungeon Lever Game and we extend the Differentiable Inter-Agent Learning (DIAL) framework. We present and compare results from different model variations on the Dungeon Lever Game. 相似文献